Expressing Algorithms as Concise as Possible via Computability Logic
نویسندگان
چکیده
منابع مشابه
Expressing Algorithms as Concise as Possible via Computability Logic
This paper proposes a new approach to defining and expressing algorithms: the notion of task logical algorithms. This notion allows the user to define an algorithm for a task T as a set of agents who can collectively perform T . This notion considerably simplifies the algorithm development process and can be seen as an integration of the sequential pseudocode and logical algorithms. This observ...
متن کاملExpressing and Supporting Efficiently Greedy Algorithms as Locally Stratified Logic Programs
The problem of expressing and supporting classical greedy algorithms in Datalog has been the focus of many signi cant research e orts that have produced very interesting solutions for particular algorithms. But we still lack a general treatment that characterizes the relationship of greedy algorithms to non-monotonic theories and leads to asymptotically optimal implementations. In this paper, w...
متن کاملIntuitionistic computability logic I
Computability logic (CL) is a systematic formal theory of computational tasks and resources, which, in a sense, can be seen as a semantics-based alternative to (the syntactically introduced) linear logic. With its expressive and flexible language, where formulas represent computational problems and “truth” is understood as algorithmic solvability, CL potentially offers a comprehensive logical b...
متن کاملMushrooms as Possible Antioxidant and Antimicrobial Agents
The aim of the study is to examine in-vitro antioxidant and antimicrobial activity of the acetonic and methanolic extracts of the mushrooms Boletus aestivalis, Boletus edulis and Leccinum carpini. Antioxidant activity was evaluated by using free radical scavenging activity and reducing power. In addition, total content of phenol and flavonoid in extracts were determined as pyrocatechol equivale...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
سال: 2014
ISSN: 0916-8508,1745-1337
DOI: 10.1587/transfun.e97.a.1385